Handling WSD using Hierarchical Clustering Algorithm with sentences
نویسندگان
چکیده
منابع مشابه
Optimal Sentence Clustering Using An Innovative Hierarchical Fuzzy Clustering Algorithm
The role of data clustering is inevitable in many text processing activities .Many proceedings are going on in this area since it has wider applications. Sentence clustering is a challenging task when compared with other data clustering, because a sentence is able to represent same ideas in different ways. For E.g. some people see a glass as half empty and some others see half full. Due to this...
متن کاملTKB-UO: Using Sense Clustering for WSD
This paper describes the clustering-based approach to Word Sense Disambiguation that is followed by the TKB-UO system at SemEval-2007. The underlying disambiguation method only uses WordNet as external resource, and does not use training data. Results obtained in both Coarse-grained English all-words task (task 7) and English fine-grained all-words subtask (task 17) are presented.
متن کاملHierarchical Clustering and Genetic Algorithm
The Traveling Salesman Problem(TSP) is one of the most intensively studied problem in computational mathematics. To solve this problem a number of algorithms have been developed using genetic algorithms. But these algorithms are not so suitable for solving large-scale TSP. This paper proposes a new solution for TSP using hierarchical clustering and genetic algorithm. Keywords— Traveling Salesma...
متن کاملDynamic Hierarchical Compact Clustering Algorithm
In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical agglomerative algorithms can be obtained, by specifying an inter-cluster similarity measure, a subgraph of the β-similarity graph, and a cover algorithm. A new clustering algorithm called Hierarchical Compact Algorithm and its ...
متن کاملGravitational Based Hierarchical Clustering Algorithm
We propose a new gravitational based hierarchical clustering algorithm using kdtree. kdtree generates densely populated packets and finds the clusters using gravitational force between the packets. Gravitational based hierarchical clustering results are of high quality and robustness. Our method is effective as well as robust. Our proposed algorithm is tested on synthetic dataset and results ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Scientific Research in Science, Engineering and Technology
سال: 2018
ISSN: 2394-4099,2395-1990
DOI: 10.32628/ijsrset1841120